Inf-datalog, Modal Logic and Complexities
نویسندگان
چکیده
Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [16]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) infDatalog. We deduce a unified and elementary proof that global model-checking (computing all nodes satisfying a formula in a given structure) has 1. quadratic data complexity in time and linear program complexity in space for CTL and alternation-free modal μ-calculus, and 2. linear-space (data and program) complexities, linear-time program complexity and polynomial-time data complexity for Lμk (modal μ-calculus with fixed alternation-depth at most k).
منابع مشابه
Complexity of Monadic inf-datalog. Application to temporal logic
In [] we defined Inf-Datalog and characterized the fragments of Monadic inf-Datalog that have the same expressive power as Modal Logic (resp. CTL, alternation-free Modal μ-calculus and Modal μ-calculus). We study here the time and space complexity of evaluation of Monadic inf-Datalog programs on finite models. We deduce a new unified proof that model checking has 1. linear data and program comp...
متن کاملAbstract Hilbertian deductive systems, infon logic, and Datalog
Hilbertian Deductive Systems, Infon Logic, and Datalog Andreas Blassa,1,∗, Yuri Gurevich aMathematics Department, University of Michigan, Ann Arbor, MI 48109, USA bMicrosoft Research, One Microsoft Way, Redmond, WA 98052, USA
متن کاملTemporal and Spatial OBDA with Many-Dimensional Halpern-Shoham Logic
We design an extension datalogHSn of datalog with hyperrectangle generalisations of HalpernShoham’s modal operators on intervals and a corresponding query language. We prove that, over n-dimensional spaces comprised of Z and R, finding certain answers to datalogHSn queries can be reduced to standard datalog query answering. We present experimental results showing the expressivity and efficiency...
متن کاملOn Modal Deductive Databases
We present a query language called MDatalog, which is an extension of Datalog for multimodal deductive databases. We define modal relational algebras and give the seminaive evaluation algorithm and the magic-set transformation for MDatalog queries. Results of this paper are proved for the multimodal logics of belief KDI4s5, KDI45, KD4s5s, KD45(m), which are extensions of the monomodal logic KD4...
متن کاملThe Data Complexity of MDatalog in Basic Modal Logics
We study the data complexity of the modal query language MDatalog and its extension eMDatalog in basic modal logics. MDatalog is a modal extension of Datalog, while eMDatalog is the general modal Horn fragment with the allowedness condition. As the main results, we prove that the data complexity of MDatalog and eMDatalog in K4, KD4, and S4 is PSPACE-complete, in K is coNP-complete, and in KD , ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 43 شماره
صفحات -
تاریخ انتشار 2009